<<<<<<< HEAD:SBtree(1)/SBtree(1)/test.cpp
#include <iostream>
using namespace std;
#include "SBTree.h"


void TestSBTree()
{
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	BSTree<int> t1;

	for (auto e : a)
	{
		t1.Insert(e);
	}
	t1.InOrder();

	t1.Erase(4);
	t1.InOrder();

	t1.Erase(14);
	t1.InOrder();

	//t1.Erase(3);
	//t1.InOrder();

	//t1.Erase(8);
	//t1.InOrder();


	for (auto e : a)
	{
		t1.Erase(e);
		t1.InOrder();
	}

	//t1.InOrder();
}

int main()
{
	TestSBTree();
	return 0;
=======
#include <iostream>
using namespace std;
#include "SBTree.h"


void TestSBTree()
{
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	BSTree<int> t1;

	for (auto e : a)
	{
		t1.Insert(e);
	}
	t1.InOrder();

	t1.Erase(4);
	t1.InOrder();

	t1.Erase(14);
	t1.InOrder();

	//t1.Erase(3);
	//t1.InOrder();

	//t1.Erase(8);
	//t1.InOrder();


	for (auto e : a)
	{
		t1.Erase(e);
		t1.InOrder();
	}

	//t1.InOrder();
}

int main()
{
	TestSBTree();
	return 0;
>>>>>>> 3c71936db160d31a0068bfbbb312dc75bc874b4b:SBTree(1)/SBTree(1)/test.cpp
}